Section: New Results
The Tamed Unadjusted Langevin Algorithm
We consider the problem of sampling from a probability measure having a density on known up to a normalizing constant, . The Euler discretization of the Langevin stochastic differential equation (SDE) is known to be unstable in a precise sense, when the potential is superlinear. Based on previous works on the taming of superlinear drift coefficients for SDEs, we introduce the Tamed Unadjusted Langevin Algorithm (TULA) and obtain non-asymptotic bounds in -total variation norm and Wasserstein distance of order 2 between the iterates of TULA and , as well as weak error bounds. Numerical experiments support our findings.